Voronoi Diagrams and Ornamental Design
نویسنده
چکیده
A set of points in the plane induces a Voronoi diagram, a division of the plane based on proximity to points in the set. Voronoi diagrams have been used extensively in engineering and scientific disciplines, but the possibility of using them for creating abstract ornamental designs is largely unexplored. I present some techniques for creating attractive ornamental designs using Voronoi diagrams. I focus on two features of Voronoi diagrams that make them particularly useful artistic tools: their conservation of symmetry, which can be used to construct interesting tilings of the plane, and their continuity with respect to changes in the generators, which makes possible smooth, organic animations of tilings.
منابع مشابه
Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملVoronoi Diagrams in Linear Time ∗
Voronoi diagrams are a well-studied data structure of proximity information, and although most cases require Ω(n log n) construction time, it is interesting and useful to develop linear-time algorithms for certain Voronoi diagrams. We develop a linear-time algorithm for abstract Voronoi diagrams in a domain where each site has a unique face and no pair of bisectors intersect outside the domain....
متن کاملOn the Hausdorff and Other Cluster Voronoi Diagrams
The Voronoi diagram is a fundamental geometric structure that encodes proximity information. Given a set of geometric objects, called sites, their Voronoi diagram is a subdivision of the underlying space into maximal regions, such that all points within one region have the same nearest site. Problems in diverse application domains (such as VLSI CAD, robotics, facility location, etc.) demand var...
متن کاملRandomized construction diagrams * incremental of abstract Voronoi Rolf
Abstract Voronoi diagrams were introduced by R. Klein (1988) as an axiomatic basis of Voronoi diagrams. We show how to construct abstract Voronoi diagrams in time O(n log n) by a randomized algorithm, which is based on Clarkson and Shor’s randomized incremental construction technique (1989). The new algorithm has the following advantages over previous algorithms: l It can handle a much wider cl...
متن کاملOn the conversion of ordinary voronoi diagrams into laguerre diagrams
We present some geometric relationships between the ordinary Voronoi diagram, and the Voronoi diagram in the Laguerre geometry. We derive from these properties an algorithm for the conversion of ordinary Voronoi diagrams into Voronoi diagrams in the Laguerre geometry.
متن کامل